Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
a(b(x)) → a(c(b(x)))
Q is empty.
↳ QTRS
↳ RFCMatchBoundsTRSProof
Q restricted rewrite system:
The TRS R consists of the following rules:
a(b(x)) → a(c(b(x)))
Q is empty.
Termination of the TRS R could be shown with a Match Bound [6,7] of 0. This implies Q-termination of R.
The following rules were used to construct the certificate:
a(b(x)) → a(c(b(x)))
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
1, 2, 3, 4
Node 1 is start node and node 2 is final node.
Those nodes are connect through the following edges:
- 1 to 3 labelled a_1(0)
- 2 to 2 labelled #_1(0)
- 3 to 4 labelled c_1(0)
- 4 to 2 labelled b_1(0)